Polynomials that Vanish on Distinct nth Roots of Unity

نویسندگان

  • André E. Kézdy
  • Hunter S. Snevily
چکیده

Let C denote the ̄eld of complex numbers and n the set of nth roots of unity. For t = 0; : : : ; n ¡ 1, de ̄ne the ideal =(n; t +1) 1⁄2 C [x0; : : : ; xt] consisting of those polynomials in t + 1 variables that vanish on distinct nth roots of unity; that is, f 2=(n; t+ 1) if and only if f (!0 ; : : : ; !t) = 0 for all (!0 ; : : : ; !t) 2 t+1 n satisfying !i 6= !j, for 0 · i < j · t. In this paper we apply GrÄ obner basis methods to give a Combinatorial Nullstellensatz characterization of the ideal =(n; t+1). In particular, if f 2 C [x0; : : : ; xt], then we give a necessary and su±cient condition on the coe±cients of f for membership in =(n; t +1).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Calculating Really Big Cyclotomic Polynomials

The following twelve poster abstracts were presented at the ANTS-8 poster session.1 ANTS-8 was held at the Banff Centre in Banff, Alberta Canada, May 17–22, 2008. The conference website, where many of the posters can be viewed online, is http://ants.math. ucalgary.ca/. Calculating Really Big Cyclotomic Polynomials Andrew Arnold and Michael Monagan, Simon Fraser University, ada26@ sfu.ca The nth...

متن کامل

Algebra Systems

The following twelve poster abstracts were presented at the ANTS-8 poster session.1 ANTS-8 was held at the Banff Centre in Banff, Alberta Canada, May 17–22, 2008. The conference website, where many of the posters can be viewed online, is http://ants.math. ucalgary.ca/. Calculating Really Big Cyclotomic Polynomials Andrew Arnold and Michael Monagan, Simon Fraser University, ada26@ sfu.ca The nth...

متن کامل

On Solving Univariate Polynomial Equations over Finite Fields and Some Related Problems

We show deterministic polynomial time algorithms over some family of finite fields for solving univariate polynomial equations and some related problems such as taking nth roots, constructing nth nonresidues, constructing primitive elements and computing elliptic curve “nth roots”. In additional, we present a deterministic polynomial time primality test for some family of integers. All algorith...

متن کامل

Reciprocal cyclotomic polynomials

Let Ψn(x) be the monic polynomial having precisely all non-primitive nth roots of unity as its simple zeros. One has Ψn(x) = (x n − 1)/Φn(x), with Φn(x) the nth cyclotomic polynomial. The coefficients of Ψn(x) are integers that like the coefficients of Φn(x) tend to be surprisingly small in absolute value, e.g. for n < 561 all coefficients of Ψn(x) are ≤ 1 in absolute value. We establish variou...

متن کامل

Notes on Fast Fourier Transform Algorithms & Data Structures

In this set of lecture notes we focus on the point-value representation obtained by looking at a particular set of points, the nth roots of unity. In the field of complex numbers C, there are exactly n different solutions to the equation x = 1. We call these solutions the n-th roots of unity. One of these roots of unity is ωn = cos(2π/n)+ i sin(2π/n), and this is called the principal nth root o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Combinatorics, Probability & Computing

دوره 13  شماره 

صفحات  -

تاریخ انتشار 2004